iterative deepening search造句
例句与造句
- The higher the branching factor, the lower the overhead of repeatedly expanded states, but even when the branching factor is 2, iterative deepening search only takes about twice as long as a complete breadth-first search.
- All together, an iterative deepening search from depth 1 all the way down to depth d expands only about 11 \ % more nodes than a single breadth-first or depth-limited search to depth d, when b = 10.
- In computer science, "'iterative deepening search "'or more specifically "'iterative deepening depth-first search "'( IDS or IDDFS ) is a nodes in the search tree in the same order as depth-first search, but the cumulative order in which nodes are first visited is effectively breadth-first.
- It's difficult to find iterative deepening search in a sentence. 用iterative deepening search造句挺难的